Function operators spanning the arithmetical and the polynomial hierarchy
نویسندگان
چکیده
منابع مشابه
Function operators spanning the arithmetical and the polynomial hierarchy
A modified version of the classical μ-operator as well as the first value operator and the operator of inverting unary functions, applied in combination with the composition of functions and starting from the primitive recursive functions, generate all arithmetically representable functions. Moreover, the nesting levels of these operators are closely related to the stratification of the arithme...
متن کاملThe Logic of Arithmetical Hierarchy
Dzhaparidze, G., The logic of arithmetical hierarchy, Annals of Pure and Applied Logic 66 (1994) 89-112. Formulas of the propositional modal language with the unary modal operators 0, H,, B,, Zz, I!!,, are considered as schemata of sentences of arithmetic (PA), where q A is interpreted as (a formalization of) “A is PA-provable”, X,,A as “A is PA-equivalent to a &-sentence” and &,A as “A is PA-e...
متن کاملAchilles and the Tortoise Climbing Up the Arithmetical Hierarchy
In this paper we show how to construct for every set P of integers in the arithmetical hierarchy a dynamical system H with piecewise constant derivatives PCD such that deciding membership in P can be reduced to solving the reachability problem between two ratio nal points for H The ability of such apparently simple dynami cal systems whose de nition involves only rational parameters to solve hi...
متن کاملAchilles and the Tortoise Climbing up the Hyper-Arithmetical Hierarchy
In this paper, we characterize the computational power of dynamical systems with piecewise constant derivatives (PCD) considered as computational machines working on a continuous real space with a continuous real time: we prove that piecewise constant derivative systems recognize precisely the languages of the ω th (respectively: ω + 1 th ) level of the hyper-arithmetical hierarchy in dimension...
متن کاملBPP and the Polynomial Hierarchy
We start with some definitions about probabilistic Turing machines (for a detailed exposition of this subject the reader is referred to [2]). Our basic model of computation is the Turing machine with input alphabet S z (0, l}. All machines are assumed to have two terminal states, namely q0 (reject) and 9, (accept). A probabilistic Turing machine (PTM) is syntactically the same as a nondetermini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2010
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/2010020